منابع مشابه
Threshold Graph Limits and Random Threshold Graphs
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
متن کاملCut locus structures on graphs
Motivated by a fundamental geometrical object, the cut locus, we introduce and study a new combinatorial structure on graphs.
متن کاملMax-cut in circulant graphs
Poljak, S. and D. Turzik, Max-cut in circulant graphs, Discrete Mathematics 108 (1992) 379-392. We study the max-cut problem in circulant graphs C,,,, where C,,, is a graph whose edge set consists of a cycle of length n and all the vertex pairs of distance r on the cycle. An efficient solution of the problem is obtained so that we show that there is always a maximum cut of a particular shape, c...
متن کاملOriented threshold graphs
Threshold graphs are a prevalent and widely studied class of simple graphs. We generalize this class of graphs to oriented graphs (directed simple graphs). We give generalizations to four of the most commonly used definitions and show their equivalence in the oriented case. We then enumerate the number of these oriented threshold graphs which relates to the Fibonacci numbers, and finish by find...
متن کاملThreshold tolerance graphs
In this paper, we introduce a class of graphs that generalize threshold graphs by introducing threshold tolerances. Several characterizations of these graphs are presented, one of which leads to a polynomial-time recognition algorithm. It is also shown that the complements of these graphs contain interval graphs and threshold graphs, and are contained in the subclass of chordal graphs called st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1991
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90042-u